Conjugacy problem for braid groups and Garside groups
نویسنده
چکیده
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee [3]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).
منابع مشابه
A New Approach to the Conjugacy Problem in Garside Groups
The cycling operation endows the super summit set Sx of any element x of a Garside group G with the structure of a directed graph Γx. We establish that the subset Ux of Sx consisting of the circuits of Γx can be used instead of Sx for deciding conjugacy to x in G, yielding a faster and more practical solution to the conjugacy problem for Garside groups. Moreover, we present a probabilistic appr...
متن کاملGrowth of Minimal Word-length in Garside Groups
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the semidirect product Z ⋉ G of the infinite cyclic group Z and the cartesian product G of a Garside group G to study the properties of roots and powers of elements in...
متن کاملComplete simultaneous conjugacy invariants in Artin's braid groups
We provide the first effectively computable, modulo a mild conjecture, complete invariant for simultaneous conjugacy in Garside groups. This invariant generalizes the notion of super summit set of a conjugacy class, and provides a solution of the simultaneous conjugacy problem in Garside groups, of complexity a small degree polynomial in the sizes of the invariant and the input parameters. Comp...
متن کاملLogspace computations for Garside groups of spindle type
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace computable. For linear Garside groups of spindle type with homogenous presentation we compute a geodesic normal form in logspace.
متن کاملAn Introduction to Combinatorial Garside Structures
The notion of a Garside group was first introduced in a paper of Dehornoy and Paris [14]. Over the past decade they have been used as a tool to better understand the structure of Artin’s braid groups [2] and their generalizations. In general, one can use the Garside structure associated with a Garside group to solve the word and conjugacy problems, as well as create a finite dimensional Eilenbe...
متن کامل